Algorithms for solving dynamic models with occasionally binding constraints
نویسندگان
چکیده
منابع مشابه
Algorithms for Solving Dynamic Models with Occasionally Binding Constraints
We describe and compare several algorithms for approximating the solution to a model in which inequality constraints occasionally bind. Their performance is evaluated and compared using various parameterizations of the one sector growth model with irreversible investment. We develop parameterized expectation algorithms which, on the basis of speed, accuracy and convenience of implementation, ap...
متن کاملOptimal Fiscal and Monetary Policy With Occasionally Binding Zero Bound Constraints
Previous studies on fiscal policy at the zero bound have focused on models with perfect foresight. However, the recent economic environment motivating such research is characterized by a high degree of uncertainty. This paper studies optimal government spending and monetary policy when the nominal interest rate is subject to the zero lower bound constraint in a stochastic environment. In the pr...
متن کاملSolving set constraints for greatest models
In set-based program analysis, one rst infers a set constraint ' from a program and then, in a constraintsolving process, one transforms ' into an e ective representation of sets of program values. Heintze and Ja ar have thus analyzed logic programs with respect to the least-model semantics. In this paper, we present a set-based analysis of logic programs with respect to the greatest model sema...
متن کاملIncremental DCOP Search Algorithms for Solving Dynamic
Distributed constraint optimization problems (DCOPs) are wellsuited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP to the next one in the sequence. We introduce the ReuseBounds procedure, which can be used by any-s...
متن کاملDynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints
Pairwise local alignment is one of the most important problems in sequence analysis in computational biology. Classical dynamic programming solution to this problem searches for two segments with maximum similarity score by discarding poorly conserved initial and terminal fragments. As a consequence, an alignment returned as optimal may contain a mosaic of well-conserved fragments arti cially c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Dynamics and Control
سال: 2000
ISSN: 0165-1889
DOI: 10.1016/s0165-1889(99)00016-0